A simple and efficient boolean solver for Constraint Logic Programming

Solver Collaboration for Constraint Logic Programming

A Unit Two Variable per Inequality Integer Constraint Solver for Constraint Logic Programming

One of the problems with the traditional nite domains approach to solving integer problems in a constraint logic programming context is that all variables require explicit bounds. If no explicit bounds are available then the nite domain solver can be very ineecient on certain classes of problem. We present an alternative approach to solving integer constraints based on a polynomial-time solver ...

Logic Programming for Boolean Networks

The Boolean network is a mathematical model of biological systems, and has attracted much attention as a qualitative tool for analyzing the regulatory system. The stable states and dynamics of Boolean networks are characterized by their attractors, whose properties have been analyzed computationally, yet not much work has been done from the viewpoint of logical inference systems. In this paper,...

Logic and Constraint Logic Programming for Distributed Constraint Optimization

The field of Distributed Constraint Optimization Problems (DCOPs) has gained momentum, thanks to its suitability in capturing complex problems (e.g., multi-agent coordination and resource allocation problems) that are naturally distributed and cannot be realistically addressed in a centralized manner. The state of the art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc c...

Towards a More Efficient Stochastic Constraint Solver

E-GENET shows certain success on extending GENET for non-binary CSP's. However, the generic constraint representation scheme of E-GENET induces the problem of storing too many penalty values in constraint nodes and the min-connicts heuristic is not eecient enough on some problems. To overcome these two weaknesses and further improve the performance, we propose several modiications. All of them ...